Characterizing the autocorrelations of binary sequences
نویسندگان
چکیده
The class of autocorrelation functions of binary sequences is studied in terms of their finite-dimensional projections; that is, the vector ranges of finite sets of consecutive correlation coefficients. These are convex polyhedra whose extreme points can be generated by binary sequences of bounded periods. Algorithms are given for the calculation of the extreme points. Tables are presented for the extreme points and supporting hyperplanes of projections of dimensions up to five. Some conclusions about the general class of autocorrelations of binary sequences are drawn from these tables.
منابع مشابه
Some Notes on Constructions of Binary Sequences with Optimal Autocorrelation
Constructions of binary sequences with low autocorrelation are considered in the paper. Based on recent progresses about this topic, several more general constructions of binary sequences with optimal autocorrelations and other low autocorrelations are presented.
متن کاملAutocorrelations of Random Binary Sequences
We define Bn to be the set of n-tuples of the form (a0, . . . , an−1) where aj = ±1. If A ∈ Bn, then we call A a binary sequence and define the autocorrelations of A by ck := ∑n−k−1 j=0 ajaj+k for 0 k n− 1. The problem of finding binary sequences with autocorrelations ‘near zero’ has arisen in communications engineering and is also relevant to conjectures of Littlewood and Erdős on ‘flat’ polyn...
متن کاملSequences with small correlation
The extent to which a sequence of finite length differs from a shifted version of itself is measured by its aperiodic autocorrelations. Of particular interest are sequences whose entries are 1 or −1, called binary sequences, and sequences whose entries are complex numbers of unit magnitude, called unimodular sequences. Since the 1950s, there is sustained interest in sequences with small aperiod...
متن کاملRun Vector Analysis and Barker Sequences of Odd Length
The run vector of a binary sequence reflects the run structure of the sequence, which is given by the set of all substrings of the run length encoding. The run vector and the aperiodic autocorrelations of a binary sequence are strongly related. In this paper, we analyze the run vector of skew-symmetric binary sequences. Using the derived results we present a new and different proof that there e...
متن کاملStatistical Properties of the Arithmetic Correlation of Sequences
In this paper we study arithmetic correlations of sequences. Arithmetic correlations are the with-carry analogs of classical correlations. We analyze the arithmetic autocorrelations of non-binary `-sequences, showing that they are nearly optimal. We analyze the expected autoand cross-correlations of sequences with fixed shift, averaged over all seqeunces with a fixed period. We analyze the expe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IEEE Trans. Information Theory
دوره 29 شماره
صفحات -
تاریخ انتشار 1983